Exact uniform sampling over catalan structures
نویسندگان
چکیده
We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with sampling, we obtain optimal coding, and optimal number of random bits required for the algorithm. The framework is based on an original two-parameter recursive relation, where Ballot and Catalan numbers appear and which may be regarded as to demonstrate a generalized reduction argument. We then describe (a) a unique n × n matrix to be used for any of the problems -the common pre-processing step of our frameworkand (b) a linear height tree, where leaves correspond one by one to all distinct solutions of each problem; sampling is essentially done by selecting a path from the root to a leaf the main algorithm. Our main algorithm is linear for a number of the problems mentioned. keywords uniform sampling, optimal coding, catalan structures, convex triangulations, ballot numbers
منابع مشابه
Staircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that is enumerated by the k-Catalan numbers, staircase tilings. We give a bijection between staircase tilings and k-good paths, and between k-good paths and k-ary trees. In addition, we enumerate k-ary paths according to D...
متن کاملUniform random sampling of planar graphs in linear time
This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of the g...
متن کاملExact Bayesian Pairwise Preference Learning and Inference on the Uniform Convex Polytope
In Bayesian approaches to utility learning from preferences, the objective is to infer a posterior belief distribution over an agent’s utility function based on previously observed agent preferences. From this, one can then estimate quantities such as the expected utility of a decision or the probability of an unobserved preference, which can then be used to make or suggest future decisions on ...
متن کاملQuadratic exact-size and linear approximate-size random generation of planar graphs
This extended abstract introduces a new algorithm for the random generation of labelled planar graphs. Its principles rely on Boltzmann samplers as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a judicious use of rejection, a new combinatorial bijection found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic description of th...
متن کاملFrequency-Domain Identification of Continuous-Time Output Error Models from Sampled Data
This paper treats identification of continuous-time output error (OE) models based on sampled data. The exact method for doing this is well known both for data given in the time and frequency domains. This approach becomes somewhat complex, especially for non-uniformly sampled data. We study various ways to approximate the exact method for reasonably fast sampling. While an objective is to gain...
متن کامل